Eléments de l'association
|
List of bibliographic references
Number of relevant bibliographic references: 68.Ident. | Authors (with country if any) | Title |
---|---|---|
000166 | Guillaume Bonfante [France] ; Reinhard Kahle [France] ; Jean-Yves Marion [France] ; Isabel Oitavem [France] | Two function algebras defining functions in NC k boolean circuits |
000269 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Fabrice Sabatier [France] | Gorille sniffs code similarities, the case study of Qwerty versus Regin |
000285 | Guillaume Bonfante [France] ; Jose Fernandez [Canada] ; Jean-Yves Marion [France] ; Benjamin Rouxel [France] ; Fabrice Sabatier [France] ; Aurélien Thierry [France] | CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping Instructions |
000466 | Guillaume Bonfante [France] ; Mohamed El-Aqqad [France] ; Benjamin Greenbaum [États-Unis] ; Mathieu Hoyrup [France] | Immune Systems in Computer Virology |
000686 | Guillaume Bonfante [France] ; Florian Deloup [France] ; Antoine Henrot [France] | Real or Natural numbers interpretations and their effect on complexity |
000887 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Thanh Dinh Ta [France] | Malware Message Classification by Dynamic Analysis |
000E59 | Guillaume Bonfante [France] ; Bruno Guillaume [France] ; Mathieu Morey ; Guy Perrier [France] | Supertagging with Constraints |
000F70 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Fabrice Sabatier [France] ; Aurélien Thierry [France] | Analysis and Diversion of Duqu's Driver |
001188 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Fabrice Sabatier [France] ; Aurélien Thierry [France] | Duqu contre Duqu : Analyse et détournement du driver de Duqu |
001289 | Guillaume Bonfante [France] ; Bruno Guillaume [France] | Non-simplifying Graph Rewriting Termination |
001752 | Guillaume Bonfante [France] ; Bruno Guillaume [France] | Non-size increasing Graph Rewriting for Natural Language Processing |
001927 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Fabrice Sabatier [France] ; Aurélien Thierry [France] | Code synchronization by morphological analysis |
001A93 | Bruno Guillaume [France] ; Guillaume Bonfante [France] ; Paul Masson ; Mathieu Morey [France] ; Guy Perrier [France] | Grew : un outil de réécriture de graphes pour le TAL |
001B77 | Guillaume Bonfante [France] ; Virgile Mogbil [France] | A circuit uniformity sharper than DLogTime |
001F65 | Guillaume Bonfante [France] | Implicit computational complexity : program interpretations |
002062 | Guillaume Bonfante [France] | Course of value distinguishes the intentionality of programming languages |
002273 | Guillaume Bonfante [France] ; Bruno Guillaume [France] ; Mathieu Morey [France] ; Guy Perrier [France] | Enrichissement de structures en dépendances par réécriture de graphes |
002479 | Guillaume Bonfante [France] ; Bruno Guillaume [France] ; Mathieu Morey [France] ; Guy Perrier [France] | Modular Graph Rewriting to Compute Semantics |
002A29 | Guillaume Bonfante [France] ; Georg Moser | Characterising Space Complexity Classes via Knuth-Bendix Orders |
002B65 | Guillaume Bonfante [France] ; Bruno Guillaume [France] ; Mathieu Morey [France] ; Guy Perrier [France] | Réécriture de graphes de dépendances pour l'interface syntaxe-sémantique |
002C61 | Guillaume Bonfante [France] ; Florian Deloup [France] | Complexity invariance of real interpretations |
002D76 | Guillaume Bonfante [France] | Observation of implicit complexity by non confluence |
003102 | Guillaume Bonfante [France] ; Florian Deloup [France] | Complexity Invariance of Real Interpretations |
003110 | Guillaume Bonfante [France] ; Georg Moser [Autriche] | Characterising Space Complexity Classes via Knuth-Bendix Orders |
003318 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Daniel Reynaud [France] | A computability perspective on self-modifying programs |
003345 | Guillaume Bonfante [France] ; Florian Deloup [France] ; Antoine Henrot [France] | Polynomials over the reals are safe for program interpretations |
003373 | Guillaume Bonfante [France] ; Bruno Guillaume [France] ; Mathieu Morey [France] | Dependency Constraints for Lexical Disambiguation |
003468 | Guillaume Bonfante [France] ; Bruno Guillaume [France] ; Mathieu Morey [France] | Word Order Constraints for Lexical Disambiguation of Interaction Grammars |
003752 | Guillaume Bonfante [France] ; Yves Guiraud [France] | Polygraphic programs and polynomial-time functions |
003B88 | Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Architecture of a morphological malware detector : EICAR 2008 |
003E16 | Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Morphological Detection of Malware |
004016 | Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | An implementation of morphological malware detection |
004325 | Guillaume Bonfante [France] ; Reinhard Kahle [Portugal] ; Jean-Yves Marion [France] ; Isabel Oitavem [Portugal] | Recursion Schemata for NC k |
004420 | Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Architecture of a morphological malware detector |
004703 | Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Control Flow to Detect Malware |
004731 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Romain Péchoux [France] | Quasi-interpretation Synthesis by Decomposition : An application to higher-order programs |
004760 | Guillaume Bonfante [France] ; Joseph Le Roux [France] | INtersection Optimization is NP-Complete |
004936 | Guillaume Bonfante [France] ; Joseph Le Roux [France] | Intersection Optimization is NP Complete |
004941 | Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Control Flow Graphs as Malware Signatures |
004967 | Guillaume Bonfante [France] ; Yves Guiraud [France] | Intensional properties of polygraphs |
004B93 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Romain Péchoux [France] | Quasi-interpretation Synthesis by Decomposition |
004C60 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] | Foreword |
004D32 | Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | A Classification of Viruses Through Recursion Theorems |
004D56 | Guillaume Bonfante [France] | Monotone interpretations |
004F44 | Romain Péchoux [France] ; Jean-Yves Marion [France] ; Guillaume Bonfante [France] | A characterization of Alternating log time by first order functional programs |
005035 | Joseph Le Roux [France] ; Guillaume Bonfante [France] ; Guy Perrier [France] | Lexical disambiguation with polarities and automata |
005080 | Guillaume Bonfante [France] | Some programming languages for LOGSPACE and PTIME |
005387 | Guillaume Bonfante [France] | Some Programming Languages for Logspace and Ptime |
005557 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Romain Péchoux [France] | A Characterization of Alternating Log Time by First Order Functional Programs |
005931 | Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Abstract Detection of Computer Viruses |
005988 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] ; Romain Péchoux [France] | Synthesis of Quasi-interpretations |
006205 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Quasi-interpretations and Small Space Bounds |
006478 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Quasi-interpretations and small space bounds |
006479 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Quasi-interpretation: a way to control ressources |
006F15 | Guillaume Bonfante [France] ; Bruno Guillaume [France] ; Guy Perrier [France] | Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation |
006F39 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | On complexity analysis by quasi-interpretation |
007B36 | Guillaume Bonfante [France] ; Bruno Guillaume [France] ; Guy Perrier [France] | Analyse syntaxique électrostatique : Évolutions en analyse syntaxique |
007D12 | Guillaume Bonfante [France] ; Bruno Guillaume [France] ; Guy Perrier [France] | Analyse syntaxique électrostatique |
009323 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | On Lexicographic Termination Ordering with Space Bound Certifications |
009456 | Guillaume Bonfante [France] ; François Lamarche [France] ; Thomas Streicher | A model of a dependent linear calculus |
009564 | Guillaume Bonfante [France] ; Philippe De Groote [France] | Stochastic Lambek Categorial Grammars |
009611 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | On lexicographic termination ordering with space bound certifications |
009797 | Guillaume Bonfante [France] | Complexity characterisation of restrictions of KBO |
00A292 | Guillaume Bonfante [France] ; François Lamarche [France] | A monotone lambda-calculus: the example of ordinal terms |
00A363 | Guillaume Bonfante [France] | Complexity characterisation of restrictions of KBO |
00AD37 | Guillaume Bonfante [France] ; François Lamarche [France] | Constructing orders by means of inductive definitions |
00B675 | Guillaume Bonfante [France] ; Adam Cichon ; Jean-Yves Marion ; Hélène Touzet | Complexity classes and rewrite systems with polynomial interpretation |
00B703 | Guillaume Bonfante [France] ; Adam Cichon ; François Lamarche | A semantics and a syntax for ordinal notations and hierarchies |
This area was generated with Dilib version V0.6.33. |